Search results for "Adjacency list"

Identification of Objects Based on Generalized Amplitude-Phase Images Statistical Models

2017

The article presents the dynamical objects identification technology based on statistical models of amplitude-phase images (APIm) – multidimensional data arrays (semantic models) and statistical correlation analysis methods using the generalized discrete Hilbert transforms (DHT) – 2D Hilbert (Foucault) isotropic (HTI), anisotropic (HTA) and total transforms – AP-analysis (APA) to calculate the APIm. The identified objects are modeled with 3D airplanes templates rotated in space around the center of Cartesian coordinate system. The DHT domain system of coordinates displaying the plane projections (2D flat images) remains to be space-invariant. That causes the anisotropic properties of APIm a…

Toward a real-time tracking of dense point-sampled geometry

2012

4 pages; International audience; In this paper, we address the problem of tracking temporal deformations between two arbitrary densely sampled point-based surfaces. We propose an intuitive and efficient resolution to the point matching problem within two frames of a sequence. The proposed method utilizes two distinct space partition trees, one for each point cloud, which both are defined on a unique discrete space. Our method takes advantage of multi-resolution concerns, voxel adjacency relations, and a specific distance function. Experimental results obtained from both simulated and real reconstructed data sets demonstrate that the proposed method can handle efficiently the tracking proces…

Variable-order reference-free variant discovery with the Burrows-Wheeler Transform

2020

Abstract Background In [Prezza et al., AMB 2019], a new reference-free and alignment-free framework for the detection of SNPs was suggested and tested. The framework, based on the Burrows-Wheeler Transform (BWT), significantly improves sensitivity and precision of previous de Bruijn graphs based tools by overcoming several of their limitations, namely: (i) the need to establish a fixed value, usually small, for the order k, (ii) the loss of important information such as k-mer coverage and adjacency of k-mers within the same read, and (iii) bad performance in repeated regions longer than k bases. The preliminary tool, however, was able to identify only SNPs and it was too slow and memory con…

Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics

2007

The original publication is available at www.springerlink.com ; ISBN 978-3-540-75519-7 ; ISSN 0302-9743 (Print) 1611-3349 (Online); International audience; We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, \ie surfaces of algebraic degree~2. This is a major step towards the computation of the full 3D arrangement. We enhanced an implementation for an exact parameterization of the intersection curves of two quadrics, such that we can compute the exact parameter value for intersection points and from that the adjacency graph of the arrangement. Our implementation is {\em complete} in the sense that it can handle all kinds of…

Criminal networks analysis in missing data scenarios through graph distances

2021

Data collected in criminal investigations may suffer from issues like: (i) incompleteness, due to the covert nature of criminal organizations; (ii) incorrectness, caused by either unintentional data collection errors or intentional deception by criminals; (iii) inconsistency, when the same information is collected into law enforcement databases multiple times, or in different formats. In this paper we analyze nine real criminal networks of different nature (i.e., Mafia networks, criminal street gangs and terrorist organizations) in order to quantify the impact of incomplete data, and to determine which network type is most affected by it. The networks are firstly pruned using two specific m…

Time and space efficient quantum algorithms for detecting cycles and testing bipartiteness

2016

We study space and time efficient quantum algorithms for two graph problems -- deciding whether an $n$-vertex graph is a forest, and whether it is bipartite. Via a reduction to the s-t connectivity problem, we describe quantum algorithms for deciding both properties in $\tilde{O}(n^{3/2})$ time and using $O(\log n)$ classical and quantum bits of storage in the adjacency matrix model. We then present quantum algorithms for deciding the two properties in the adjacency array model, which run in time $\tilde{O}(n\sqrt{d_m})$ and also require $O(\log n)$ space, where $d_m$ is the maximum degree of any vertex in the input graph.

2021

Data collected in criminal investigations may suffer from issues like: (i) incompleteness, due to the covert nature of criminal organizations; (ii) incorrectness, caused by either unintentional data collection errors or intentional deception by criminals; (iii) inconsistency, when the same information is collected into law enforcement databases multiple times, or in different formats. In this paper we analyze nine real criminal networks of different nature (i.e., Mafia networks, criminal street gangs and terrorist organizations) in order to quantify the impact of incomplete data, and to determine which network type is most affected by it. The networks are firstly pruned using two specific m…

On the use of adaptive spatial weight matrices from disease mapping multivariate analyses

2020

Conditional autoregressive distributions are commonly used to model spatial dependence between nearby geographic units in disease mapping studies. These distributions induce spatial dependence by means of a spatial weights matrix that quantifies the strength of dependence between any two neighboring spatial units. The most common procedure for defining that spatial weights matrix is using an adjacency criterion. In that case, all pairs of spatial units with adjacent borders are given the same weight (typically 1) and the remaining non-adjacent units are assigned a weight of 0. However, assuming all spatial neighbors in a model to be equally influential could be possibly a too rigid or inapp…

A fully automated method for accurate measurement of geometrical distortion in magnetic resonance imaging of a 3D-lattice phantom

2019

Abstract This paper describes an automated method for extracting the apparent positions of fiducial points from 2D or 3D images of a phantom. We consider a 3D-lattice phantom for two main reasons: first, ease of manufacture and isotropy of its structure with respect to coordinate projections; second, a connected structure allowing to uniquely assess the adjacency relationship between fiducial points even if geometric distortions arising from main magnet inhomogeneity and gradient fields non-linearity is severe as observed in open-bore systems. In order to validate our proposed method and compare different choices for the parameters of our phantom (i.e. number and distance between grids and …

A multi-objective approach to facility layout problem by genetic search algorithm and Electre method

2006

Abstract Classical approaches to layout design problem tend to maximise the efficiency of layout, measured by the handling cost related to the interdepartmental flow and to the distance among the departments. However, the actual problem involves several conflicting objectives hence requiring a multi-objective formulation. Multi-objective approaches, recently proposed, in most cases lead to the maximisation of a weighted sum of score functions. The poor practicability of such an approach is due to the difficulty of normalising these functions and of quantifying the weights. In this paper, this difficulty is overcome by approaching the problem in two subsequent steps: in the first step, the P…